Real closed field

Results: 43



#Item
11INFINITESIMALS ARE TOO SMALL FOR COUNTABLY INFINITE FAIR LOTTERIES ALEXANDER R. PRUSS Abstract. We show that infinitesimal probabilities are much too small for modeling the individual outcome of a countably infinite fair

INFINITESIMALS ARE TOO SMALL FOR COUNTABLY INFINITE FAIR LOTTERIES ALEXANDER R. PRUSS Abstract. We show that infinitesimal probabilities are much too small for modeling the individual outcome of a countably infinite fair

Add to Reading List

Source URL: alexanderpruss.com

Language: English - Date: 2013-06-12 13:10:22
12OVERLOAD  CONTENTS OVERLOAD 108

OVERLOAD CONTENTS OVERLOAD 108

Add to Reading List

Source URL: accu.org

Language: English - Date: 2012-04-10 15:20:14
13Computing the infinite Sam Sanders1 Tohoku University & Ghent University LICS11, June 22, 2011, Fields Institute, Toronto

Computing the infinite Sam Sanders1 Tohoku University & Ghent University LICS11, June 22, 2011, Fields Institute, Toronto

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2011-08-06 12:41:28
14

PDF Document

Add to Reading List

Source URL: gfisher.org

Language: English - Date: 2010-08-13 00:31:47
15The Bulletin of Symbolic Logic Volume 18, Number 1, March 2012 THE ABSOLUTE ARITHMETIC CONTINUUM AND THE UNIFICATION OF ALL NUMBERS GREAT AND SMALL

The Bulletin of Symbolic Logic Volume 18, Number 1, March 2012 THE ABSOLUTE ARITHMETIC CONTINUUM AND THE UNIFICATION OF ALL NUMBERS GREAT AND SMALL

Add to Reading List

Source URL: www.ohio.edu

Language: English - Date: 2012-01-31 12:26:37
16ASYMPTOTIC DENSITY AND THE ERSHOV HIERARCHY ROD DOWNEY, CARL JOCKUSCH, TIMOTHY H. MCNICHOLL, AND PAUL SCHUPP Abstract. We classify the asymptotic densities of the ∆02 sets according to their level in the Ershov hierarc

ASYMPTOTIC DENSITY AND THE ERSHOV HIERARCHY ROD DOWNEY, CARL JOCKUSCH, TIMOTHY H. MCNICHOLL, AND PAUL SCHUPP Abstract. We classify the asymptotic densities of the ∆02 sets according to their level in the Ershov hierarc

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-02-03 11:22:38
17POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#

POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-06-16 13:44:12
18REFINED BOUNDS ON THE NUMBER OF CONNECTED COMPONENTS OF SIGN CONDITIONS ON A VARIETY SAL BARONE AND SAUGATA BASU Abstract. Let R be a real closed field, P, Q ⊂ R[X1 , . . . , Xk ] finite subsets of polynomials, with th

REFINED BOUNDS ON THE NUMBER OF CONNECTED COMPONENTS OF SIGN CONDITIONS ON A VARIETY SAL BARONE AND SAUGATA BASU Abstract. Let R be a real closed field, P, Q ⊂ R[X1 , . . . , Xk ] finite subsets of polynomials, with th

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2011-11-06 10:09:22
19ON THE BETTI NUMBERS OF SIGN CONDITIONS SAUGATA BASU, RICHARD POLLACK, AND MARIE-FRANC ¸ OISE ROY Abstract. Let R be a real closed field and let Q and P be finite subsets of R[XV1 , . . . , Xk ] such that the set P has

ON THE BETTI NUMBERS OF SIGN CONDITIONS SAUGATA BASU, RICHARD POLLACK, AND MARIE-FRANC ¸ OISE ROY Abstract. Let R be a real closed field and let Q and P be finite subsets of R[XV1 , . . . , Xk ] such that the set P has

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-06-16 13:36:45
20A BABY STEP-GIANT STEP ROADMAP ALGORITHM FOR GENERAL ALGEBRAIC SETS ´ SCHOST S. BASU, M-F. ROY, M. SAFEY EL DIN, AND E. Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that tak

A BABY STEP-GIANT STEP ROADMAP ALGORITHM FOR GENERAL ALGEBRAIC SETS ´ SCHOST S. BASU, M-F. ROY, M. SAFEY EL DIN, AND E. Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that tak

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2012-01-30 23:55:12